Infinite Lexicographic Products

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representable Lexicographic Products

A linear ordering is said to be representable if it can be order-embedded into the reals. Representable linear orderings have been characterized as those which are separable in the order topology and have at most countably many jumps. We use this characterization to study the representability of a lexicographic product of linear orderings. First we count the jumps in a lexicographic product in ...

متن کامل

Absorbing Lexicographic Products in Metarouting

Modern treatments of routing protocols use algebraic techniques to derive the protocol’s properties, permitting a semantic richness more flexible than simple numerical “shortest paths”. Many such routing protocols make preference decisions based on multiple criteria. This fits well with an algebraic formulation with each strata in the decision process modeled as an algebraic structure, that are...

متن کامل

Functional Equations for Lexicographic Products *

We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆Γ. For a fixed non-empty chain ∆, we derive necessary and sufficient conditions for the existence of non-empty solutions Γ to each of the lexicographic functional equations (∆) ≃ Γ , (∆) ≃ Γ and (∆) ≃ Γ .

متن کامل

Rees products and lexicographic shellability

We use the theory of lexicographic shellability to provide various examples in which the rank of the homology of a Rees product of two partially ordered sets enumerates some set of combinatorial objects, perhaps according to some natural statistic on the set. Many of these examples generalize a result of J. Jonsson, which says that the rank of the unique nontrivial homology group of the Rees pr...

متن کامل

Functorial Equations for Lexicographic Products

We generalize the main result of [K–K–S] concerning the convex embeddings of a chain Γ in a lexicographic power ∆Γ. For a fixed non-empty chain ∆, we derive necessary and sufficient conditions for the existence of non-empty solutions Γ to each of the lexicographic functorial equations (∆) ' Γ , (∆) ' Γ and (∆) ' Γ .

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Pure and Applied Logic

سال: 2021

ISSN: 0168-0072

DOI: 10.1016/j.apal.2021.102991